Resultaten visas 1 - 10 / 851
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

BCSat 0.3 - a satisfiability checker for Boolean circuits

Junttila, Tommi
-2001

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Referentgranskad
Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka
-2004

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Referentgranskad
DOI
10.1007/s10472-005-7034-1
Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka
Annals of Mathematics and Artificial Intelligence2005

BC package - tools for constrained Boolean circuits

Junttila, Tommi
-2006

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Referentgranskad
DOI
10.1007/3-540-44957-4_37
Junttila, Tommi; Niemelä, Ilkka
Lecture Notes in Computer Science2000

Embedding Arbitrary Boolean Circuits into Fungal Automata

Referentgranskad
Öppen tillgång
DOI
10.1007/s00453-024-01222-7
Modanese, Augusto; Worsch, Thomas
Algorithmica2024

Separating OR, SUM, and XOR Circuits

Referentgranskad
DOI
10.1016/j.jcss.2016.01.001
Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H.
Journal of computer and system sciences2016

Solving Boolean Equation Systems

Keinänen, Misa
-2005

Computing stable models via reductions to boolean circuits and difference logic

Referentgranskad
Janhunen, Tomi; Niemelä, Ilkka; Sevalnev, Mark
-2008

Multidimensional Linear Distinguishing Attacks and Boolean Functions

Referentgranskad
Hermelin, Miia; Nyberg, Kaisa
-2008

BCSat 0.3 - a satisfiability checker for Boolean circuits

2001

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Referentgranskad
2004

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Referentgranskad
DOI
10.1007/s10472-005-7034-1
2005

BC package - tools for constrained Boolean circuits

2006

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Referentgranskad
DOI
10.1007/3-540-44957-4_37
2000

Embedding Arbitrary Boolean Circuits into Fungal Automata

Referentgranskad
Öppen tillgång
DOI
10.1007/s00453-024-01222-7
2024

Separating OR, SUM, and XOR Circuits

Referentgranskad
DOI
10.1016/j.jcss.2016.01.001
2016

Solving Boolean Equation Systems

2005

Computing stable models via reductions to boolean circuits and difference logic

Referentgranskad
2008

Multidimensional Linear Distinguishing Attacks and Boolean Functions

Referentgranskad
2008